Confidence-based reasoning in stochastic constraint programming
نویسندگان
چکیده
منابع مشابه
Confidence-based Reasoning in Stochastic Constraint Programming
In this work we introduce a novel approach, based on sampling, for finding policies that are likely to be solutions to stochastic constraint satisfaction problems and constraint optimisation problems. Our approach reduces the size of the original problem being analysed and it guarantees that, with a given confidence probability, the policies produced by solving this reduced problem satisfy the ...
متن کاملConstraint - Based Reasoning and Constraint Programming 182
We show the equivalence between the so-called DavisPutnam procedure [3, 2] and the Forward Checking of Haralick and Elliot [7]. Both apply the paradigm choose and propagate in two different formalisms, namely the propositional calculus and the constraint satisfaction problems formalism. They happen to be strictly equivalent as soon as a compatible instantiation order is chosen. This equivalence...
متن کاملScenario-based Stochastic Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we extend the stochastic constraint programming framework proposed in [Walsh, 2002] along a number of important dimensions (e.g. to multiple chance constraints and to a range of new objectives). We also provide a new (but equivalent) semantics based on scenarios. Using this semantics, we can compile stochastic const...
متن کاملConfidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing not only allows for dynamic load balancing, but also determines which parts of the search tree are searched next. Thus the place from where work is stolen has a dramatic effect on the efficiency of a parallel search a...
متن کاملStochastic Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision variables (which we can set) and stochastic variables (which follow a probability distribution). They combine together the best features of traditional constraint satisfaction, stochastic integer programming, and sto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2015
ISSN: 0004-3702
DOI: 10.1016/j.artint.2015.07.004